Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 24933 | Accepted: 8662 |
Description
Input
Output
Sorted sequence determined after xxx relations: yyy...y.
Sorted sequence cannot be determined.
Inconsistency found after xxx relations.
where xxx is the number of relations processed at the time either a sorted sequence is determined or an inconsistency is found, whichever comes first, and yyy...y is the sorted, ascending sequence.
Sample Input
4 6 A<B A<C B<C C<D B<D A<B 3 2 A<B B<A 26 1 A<Z 0 0
Sample Output
Sorted sequence determined after 4 relations: ABCD. Inconsistency found after 2 relations. Sorted sequence cannot be determined.
先判断是否有环,再判断是否无法排序,第二步判断之后不能立即跳出,因为无法确定之后是否有环;
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int mp[30][30],in[30],q[30];
int topo(int n)
{
int c=0,temp[30],loc,m,flag=1;
for(int i=1;i<=n;i++)
temp[i]=in[i];
for(int i=1;i<=n;i++)
{
m=0;
for(int j=1;j<=n;j++)
if(temp[j]==0)
{
m++;
loc=j;//记录0入度点的位置
}
if(m==0)
return 0;
if(m>1)
flag=-1;//说明此时无序,但不能判断之后是否有环
q[c++]=loc;
temp[loc]=-1;
for(int j=1;j<=n;j++)
if(mp[loc][j])
temp[j]--;
}
return flag;
}
int main()
{
int m,n,sign;
char str[5];
while(~scanf("%d%d",&n,&m)&&n&&m)
{
memset(mp,0,sizeof(mp));
memset(in,0,sizeof(in));
sign=0;
for(int i=1;i<=m;i++)
{
scanf("%s",str);
if(sign)
continue;
int x=str[0]-'A'+1;
int y=str[2]-'A'+1;
mp[x][y]=1;
in[y]++;
int s=topo(n);
if(s==0)
{
printf("Inconsistency found after %d relations.\n",i);
sign=1;
}
if(s==1)
{
printf("Sorted sequence determined after %d relations: ",i);
for(int j=0;j<n;j++)
printf("%c",q[j]+'A'-1);
printf(".\n");
sign=1;
}
}
if(!sign)
printf("Sorted sequence cannot be determined. \n");
}
return 0;
}